package com.explorati.LeetCode215.Kthlargestelementinanarray;

import java.util.Arrays;

public class Solution1 {
	public int findKthLargest(int[] nums, int k) {
		Arrays.sort(nums);

		return nums[nums.length - k];
	}
}
